Convex Hop Domination in Graphs

Let G be an undirected connected graph with vertex and edge sets V (G) E(G), respectively. A set C ⊆ is called convex hop dominating if for every two vertices x, y ∈ C, the of x-y geodesic contained in v \ there exists w such that dG(v, w) = 2. The minimum cardinality G, denoted by γconh(G), domination number G. In this paper, we show positive integers a b, where 2 ≤ are realizable as number, respectively, graph. We also characterize some graphs determine their numbers.